1 9 N ov 2 00 6 Quickest Detection for a Poisson Process with a Phase - type Change - time Distribution ∗ † ‡
نویسندگان
چکیده
We consider a change detection problem in which the arrival rate of a Poisson process changes suddenly at some unknown and unobservable disorder time. It is assumed that the prior distribution of the disorder time is known. The objective is to detect the disorder time with an online detection rule (a stopping time) in a way that balances the frequency of false alarm and detection delay. So far in the study of this problem, the prior distribution of the disorder time is taken to be exponential distribution for analytical tractability. Here, we will take the prior distribution to be a phase-type distribution, which is the distribution of the absorption time of a continuous time Markov chain with a finite state space. We find an optimal stopping rule for this general case and give a numerical algorithm that calculates the parameters of ε-optimal strategies for any ε > 0. We illustrate our findings on two examples.
منابع مشابه
Bayesian change point estimation in Poisson-based control charts
Precise identification of the time when a process has changed enables process engineers to search for a potential special cause more effectively. In this paper, we develop change point estimation methods for a Poisson process in a Bayesian framework. We apply Bayesian hierarchical models to formulate the change point where there exists a step < /div> change, a linear trend and a known multip...
متن کاملQuickest Detection with Social Learning: Interaction of local and global decision makers
We consider how local and global decision policies interact in stopping time problems such as quickest time change detection. Individual agents make myopic local decisions via social learning, that is, each agent records a private observation of a noisy underlying state process, selfishly optimizes its local utility and then broadcasts its local decision. Given these local decisions, how can a ...
متن کامل1 4 N ov 2 00 6 On a model for the storage of files on a hardware I : Statistics at a fixed time and asymptotics
We consider a generalized version in continuous time of the parking problem of Knuth. Files arrive following a Poisson point process and are stored on a hardware identified with the real line. We specify the distribution of the space of unoccupied locations at a fixed time and give its asymptotics when the hardware is becoming full.
متن کاملQuickest detection of intensity change for Poisson process in generalized Bayesian setting
The paper deals with the quickest detection of intensity change for Poisson process. We show that the generalized Bayesian formulation of the quickest detection problem can be reduced to the conditional-extremal optimal stopping problem for a piecewise-deterministic Markov process. For this problem the optimal procedure is described and its characteristics are found.
متن کاملدربارۀ شناسایی بیزیِ دنبالهای نقطۀ تغییر
The problems of sequential change-point have several important applications in quality control, signal processing, and failure detection in industry and finance and signal detection. We discuss a Bayesian approach in the context of statistical process control: at an unknown time τ, the process behavior changes and the distribution of the data changes from p0 to p1. Two cases are consi...
متن کامل